An Unconstrained Optimization Technique for Nonsmooth Nonlinear Complementarity Problems

نویسنده

  • M. A. TAWHID
چکیده

In this article, we consider an unconstrained minimization formulation of the nonlinear complementarity problem NCP(f) when the underlying functions are H-differentiable but not necessarily locally Lipschitzian or directionally differentiable. We show how, under appropriate regularity conditions on an H-differential of f , minimizing the merit function corresponding to f leads to a solution of the nonlinear complementarity problem. Our results give a unified treatment of such results for C-functions, semismooth-functions, and for locally Lipschitzian functions. We also show a result on the global convergence of a derivative-free descent algorithm for solving nonsmooth nonlinear complementarity problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems

Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...

متن کامل

Nonsmooth Newton’s Method and Semidefinite Optimization

We introduce basic ideas of a nonsmooth Newton’s method and its application in solving semidefinite optimization (SDO) problems. In particular, the method can be used to solve both linear and nonlinear semidefinite complementarity problems. We also survey recent theoretical results in matrix functions and stability of SDO that are stemed from the research on the matrix form of the nonsmooth New...

متن کامل

A Trust Region Algorithm Model With Radius Bounded Below for Minimization of Locally Lipschitzian Functions∗

The classical trust region algorithm was extended to the nonsmooth minimization problem successful by Qi and Sun. Combining the trust region algorithm of Qi and Sun and the trust region algorithm with radius bounded below of Jiang for solving generalized complementarity problems, this paper present a new trust region algorithm with radius bounded below for the unconstrained nonsmooth optimizati...

متن کامل

Solution of Nonsmooth Generalized Complementarity Problems

We consider an unconstrained minimization reformulation of the generalized complementarity problem GCP(f, g) when the underlying functions f and g are H-differentiable. We describe H-differentials of some GCP functions based on the min function and the penalized Fischer-Burmeister function, and their merit functions. Under appropriate semimonotone (E0), strictly semimonotone (E) regularity-cond...

متن کامل

Nonlinear complementarity as unconstrained and constrained minimization

The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtained from an augmented Lagrangian formulation. The dimensionality of the unconstrained problem is the same as that of the original problem, and the penalty parameter need only be greater than one. Another feature of the unconstrained problem is that it has global minima of zero at precisely all th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009